Finding all minimum-size separating vertex sets in a graph
نویسندگان
چکیده
منابع مشابه
Finding all minimum-size separating vertex sets in a graph
We present a new algorithm based upon network flows for finding all minimum size separating vertex sets in an undirected graph. The sequential implementation of our algorithm runs in ®(mm(max(Mnk,knmmin(k,'In)),mQx(Mn,k2n3))) = 0 (2 kn3) time, where M is the number of minimum size separating vertex sets The parallel implementai 6 tion runs either in 0 (&logn) deterministic time using ©(M2n2 + k...
متن کاملFinding minimum feedback vertex set in bipartite graph
We show that minimum feedback vertex set in a bipartite graph on n vertices can be found in 1.8621 · nO(1) time.
متن کاملMinimum feedback vertex sets in circle graphs
We describe a polynomial time algorithm to find a minimum feedback vertex set, or equivalently, a maximum induced forest, in a circle graph. The circle graphs are the overlap graphs of intervals on a line.
متن کاملAn Algorithm for Finding Minimum d-Separating Sets in Belief Networks
The criterion commonly used in directed acyclic graphs ( dags) for testing graphical independence is the well-known d-separation criterion. It allows us to build graphical re presentations of dependency models (usually probabilistic dependency models) in the form of belief networks, which make easy inter pretation and management of independence relationships p ossible , without reference to n...
متن کاملDifferent-Distance Sets in a Graph
A set of vertices $S$ in a connected graph $G$ is a different-distance set if, for any vertex $w$ outside $S$, no two vertices in $S$ have the same distance to $w$.The lower and upper different-distance number of a graph are the order of a smallest, respectively largest, maximal different-distance set.We prove that a different-distance set induces either a special type of path or an independent...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Networks
سال: 1993
ISSN: 0028-3045,1097-0037
DOI: 10.1002/net.3230230604